A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates
نویسندگان
چکیده
منابع مشابه
The Vehicle Routing Problem with Release and Due Dates
FACULTY OF SOCIAL, HUMAN AND MATHEMATICAL SCIENCES Mathematical Sciences Doctor of Philosophy THE VEHICLE ROUTING PROBLEM WITH RELEASE AND DUE DATES: FORMULATIONS, HEURISTICS AND LOWER BOUNDS Benjamin C. Shelbourne A novel extension of the classical vehicle routing and scheduling problem is proposed that integrates aspects of machine scheduling into vehicle routing. Associated to each customer ...
متن کاملA branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
We consider the Commodity constrained Split Delivery Vehicle Routing Problem (CSDVRP), a routing problem where customers may request multiple commodities. The vehicles can deliver any set of commodities, and multiple visits to a customer are allowed only if the customer requests multiple commodities. If the customer is visited more than once, the different vehicles will deliver different sets o...
متن کاملA Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The columns in the formulation are associated to q-routes, a relaxation of capacitated elementary routes that makes the pricing problem solvable in pseudo-polynomial time. Powerful new families of cuts are also proposed, which ...
متن کاملA Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem
We study a variant of the capacitated vehicle routing problem where the cost over each arc is defined as the product of the arc length and the weight of the vehicle when it traverses that arc. We propose two new mixed integer linear programming formulations for the problem: an arc-load formulation and a set partitioning formulation based on q-routes with additional constraints. A family of cycl...
متن کاملA branch-price-and-cut for the vehicle routing problem with time windows and multiple deliverymen
We address a variant of the vehicle routing problem with time windows, which includes the decision of how many deliverymen should be assigned to each vehicle in addition to the usual routing and scheduling decisions. This variant is relevant in cases in which many requests should be delivered in busy urban areas on the same day, and the service times at customers are long in relation to vehicle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part E: Logistics and Transportation Review
سال: 2021
ISSN: 1366-5545
DOI: 10.1016/j.tre.2020.102167